Counting hyperelliptic curves that admit a Koblitz model

نویسندگان

  • Cevahir Demirkiran
  • Enric Nart
چکیده

Let k = Fq be a finite field of odd characteristic. We find a closed formula for the number of k-isomorphism classes of pointed, and non-pointed, hyperelliptic curves of genus g over k, admitting a Koblitz model. These numbers are expressed as a polynomial in q with integer coefficients (for pointed curves) and rational coefficients (for nonpointed curves). The coefficients depend on g and the set of divisors of q − 1 and q + 1. These formulas show that the number of hyperelliptic curves of genus g suitable (in principle) of cryptographic applications is asymptotically (1 − e−1)2q2g−1, and not 2q2g−1 as it was believed. The curves of genus g = 2 and g = 3 are more resistant to the attacks to the DLP; for these values of g the number of curves is respectively (91/72)q + O(q) and (3641/2880)q + O(q).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Counting Hyperelliptic Curves That Admit a Koblitz Model Cevahir Demirkiran and Enric Nart

Abstract. Let k = Fq be a finite field of odd characteristic. We find a closed formula for the number of k-isomorphism classes of pointed, and non-pointed, hyperelliptic curves of genus g over k, admitting a Koblitz model. These numbers are expressed as a polynomial in q with integer coefficients (for pointed curves) and rational coefficients (for nonpointed curves). The coefficients depend on ...

متن کامل

Some properties of $τ$-adic expansions on hyperelliptic Koblitz curves

This paper explores two techniques on a family of hyperelliptic curves that have been proposed to accelerate computation of scalar multiplication for hyperelliptic curve cryptosystems. In elliptic curve cryptosystems, it is known that Koblitz curves admit fast scalar multiplication, namely, the τ -adic non-adjacent form (τ -NAF). It is shown that the τ -NAF has the three properties: (1) existen...

متن کامل

Speeding Up Point Multiplication on Hyperelliptic Curves with Efficiently-Computable Endomorphisms

As Koblitz curves were generalized to hyperelliptic Koblitz curves for faster point multiplication by Günter,et al [10], we extend the recent work of Gallant,et al [8] to hyperelliptic curves. So the extended method for speeding point multiplication applies to a much larger family of hyperelliptic curves over finite fields that have efficiently-computable endomorphisms. For this special family ...

متن کامل

Hyperelliptic Curve Cryptography

The use of elliptic-curve groups in cryptography, suggested by Miller [1] and Koblitz [2] three decades ago,provides the same level of security for the Discrete Logarithm Problem as multiplicative groups, with much smallerkey sizes and parameters. The idea was refined two years later by Koblitz, who worked with the group formed bythe points of the Jacobian of hyperelliptic curve...

متن کامل

Speeding up the Arithmetic on Koblitz Curves of Genus Two

Koblitz, Solinas, and others investigated a family of elliptic curves which admit especially fast elliptic scalar multiplication. They considered elliptic curves deened over the nite eld F 2 with base eld F 2 n. In this paper, we generalize their ideas to hyperelliptic curves of genus 2. Given the two hyperelliptic curves C a : v 2 +uv = u 5 + a u 2 + 1 with a = 0; 1, we show how to speed up th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2007  شماره 

صفحات  -

تاریخ انتشار 2007